The matrix of capacitance as a positive matrix: physical and mathematical implications
نویسندگان
چکیده
We prove that the matrix of capacitance in electrostatics is a positive matrix. We explore the physical implications of this mathematical fact, and study the eigenvalue problem for the matrix of capacitance and its physical meaning. Many properties are easily visualized by constructing a “potential space” isomorphic to the euclidian space and defining an inner product in it. The problem of minimizing the internal energy of a system of conductors under constraints is considered, and an equivalent capacitance is obtained for an arbitrary number of conductors. Moreover, some properties of systems of conductors in succesive embedding are examined. Finally, we prove that the formulation utilized here is gauge invariant while the one used in the literature is not.
منابع مشابه
The positivity and other properties of the matrix of capacitance: physical and mathematical implications
We prove that the matrix of capacitance in electrostatics is a positive matrix. We explore the physical implications of this mathematical fact, and study the eigenvalue problem for the matrix of capacitance and its physical meaning. Many properties are easily visualized by constructing a “potential space” isomorphic to the euclidian space and defining an inner product in it. The problem of mini...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe least-square bisymmetric solution to a quaternion matrix equation with applications
In this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation XA=B to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. Futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. As applications, we derive sufficient and necess...
متن کاملHigher numerical ranges of matrix polynomials
Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کامل